Planar L - Shaped Point Set Embeddings of Trees ∗
نویسندگان
چکیده
In this paper we consider planar L-shaped embeddings of trees in point sets, that is, planar drawings where the vertices are mapped to a subset of the given points and where every edge consists of two axis-aligned line segments. We investigate the minimum number m, such that any n vertex tree with maximum degree 4 admits a planar L-shaped embedding in any point set of size m. First we give an upper bound O(n) with c = log2 3 ≈ 1.585 for the general case, and thus answer the question by Di Giacomo et al. [4] whether a subquadratic upper bound exists. Then we introduce the saturation function for trees and show that trees with low saturation can be embedded even more efficiently. In particular, we improve the upper bound for caterpillars and extend the class of trees that require only a linear number of points. In addition, we present some probabilistic results for either randomly chosen trees or randomly chosen point sets.
منابع مشابه
Plane 3-trees: Embeddability & Approximation
We give anO(n log n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the plane, determines whether G has a point-set embedding on S (i.e., a planar straight-line drawing of G where each vertex is mapped to a distinct point of S), improving the O(n)-time O(n)-space algorithm of Moosa and Rahman. Given an arbitrary plane graph G and a point set ...
متن کاملOrthogeodesic Point-Set Embedding of Trees
Let S be a set of N grid points in the plane, and let G a graph with n vertices (n ≤ N). An orthogeodesic point-set embedding of G on S is a drawing of G such that each vertex is drawn as a point of S and each edge is a chain of horizontal and vertical segments with bends on grid points whose length is equal to the Manhattan distance of its end vertices. We study the following problem. Given a ...
متن کاملOn counting planar embeddings
A method for counting the embeddings of a connected but not necessarily biconnected planar graph is given. The method relates the embedding of edges around an articulation point to a tree structure called an embedding tree. MacLane [S] gives a method for counting the number of distinct embeddings of a biconnected planar graph. This method is based on a decomposition into triconnetted components...
متن کاملImproved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an orthogonal path with one bend (an “L-shaped” edge). By giving new methods for drawing trees, we improve the bounds on the size of the point set P f...
متن کاملPoint-Set Embeddability of 2-Colored Trees
In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016